Minimum spanning tree

Results: 280



#Item
11Graph theory / NP-complete problems / Spanning tree / Axiom of choice / Graph coloring / Tree

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Add to Reading List

Source URL: www.grupolys.org

Language: English - Date: 2016-05-11 06:39:57
12Mathematics / Geometry / Computer science / Search algorithms / Discrete geometry / Computational geometry / Mathematical optimization / Closest pair of points problem / Nearest neighbor search / Nearest neighbor graph / K-nearest neighbors algorithm / Euclidean minimum spanning tree

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

Add to Reading List

Source URL: bioinfo.ict.ac.cn

Language: English - Date: 2014-11-28 11:05:21
13Graph theory / Phylogenetics / Computational phylogenetics / Maximum parsimony / Chordal graph / Disk-covering method / Phylogenetic tree / Neighbor joining / Tree / Tree decomposition / Minimum spanning tree

1 Disk Covering Methods: improving the accuracy and speed of large-scale phylogenetic analyses 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 Phylogenetic ana

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-08-30 15:58:30
14Graph theory / Computational complexity theory / Mathematics / Spanning tree / NP-complete problems / Approximation algorithms / Steiner tree problem / Complexity classes / APX / Combinatorial optimization / Minimum spanning tree / Cut

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
15Graph theory / Mathematics / Spanning tree / Operations research / NP-complete problems / Dynamic programming / Equations / Systems engineering / Vertex cover / Minimum spanning tree

On the Tree Search Problem with Non-uniform Costs Ferdinando Cicalese∗ Bal´azs Keszegh† Bernard Lidick´

Add to Reading List

Source URL: orion.math.iastate.edu

Language: English - Date: 2014-08-22 14:44:58
16Graph theory / Mathematics / Spanning tree / Steiner tree problem / Minimum spanning tree / Shortest path problem / Eulerian path / Line graph / Expected linear time MST algorithm / Minimum bottleneck spanning tree

CS264: Homework #10 Due by midnight on Wednesday, December 10, 2014 Instructions: (1) Students taking the course pass-fail should complete 5 of the exercises. Students taking the course for a letter grade should complete

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-12-10 00:55:12
17Graph theory / Computational complexity theory / Mathematics / NP-complete problems / Spanning tree / Steiner tree problem / Operations research / Knowledge representation / Edsger W. Dijkstra / Minimum spanning tree / Travelling salesman problem / Approximation algorithm

Robust Reoptimization of Steiner Trees∗ Keshav Goyal1 and Tobias Mömke2 1 2 IIT Delhi, India,

Add to Reading List

Source URL: drops.dagstuhl.de

Language: English - Date: 2015-12-11 12:58:32
18Spanning tree / Mathematics / Distributed computing / Minimum spanning tree / Routing / Algorithm

CPSC 455b Written Homework Assignment # 1

Add to Reading List

Source URL: zoo.cs.yale.edu

Language: English - Date: 2011-08-29 17:33:56
19Image segmentation / Computer vision / Vision / Artificial intelligence / Region growing / Range segmentation / Minimum spanning tree / Optical flow / Hierarchical clustering / Rigid motion segmentation / Segmentation-based object categorization

Efficient Hierarchical Graph-Based Segmentation of RGBD Videos Steven Hickson1 Stan Birchfield2 Irfan Essa1

Add to Reading List

Source URL: www.cc.gatech.edu

Language: English - Date: 2014-07-16 10:51:30
20Computational complexity theory / Theory of computation / Analysis of algorithms / NP-complete problems / Set cover problem / Randomized algorithm / Time complexity / Minimum spanning tree / Point location

Output-Sensitive Construction of the Union of Triangles  Esther Ezra and Micha Sharir School of Computer Science

Add to Reading List

Source URL: www.math.tau.ac.il

Language: English - Date: 2007-08-27 22:45:23
UPDATE